Stress mixes chromosomes

Hit-and-run mixes fast

It is shown that the “hit-and-run” algorithm for sampling from a convex body K (introduced by R.L. Smith) mixes in time O(nR/r), where R and r are the radii of the inscribed and circumscribed balls of K. Thus after appropriate preprocessing, hit-andrun produces an approximately uniformly distributed sample point in time O(n), which matches the best known bound for other sampling algorithms. We ...

Naive Mixes for Word Sense Disambiguation

The Naive Mix is a new supervised learning algorithm based on sequential model selection. The usual objective of model selection is to nd a single proba-bilistic model that adequately characterizes, i.e. ts, the data in a training sample. The Naive Mix combines models discarded during the selection process with the best{{tting model to form an averaged probabilistic model. This is shown to impr...

Scheduling Query Mixes: Dynamic Concurrency Control

Protection Profiles for Remailer Mixes

In the past independent IT security evaluation according to published criteria has not realized its potential for the assessment of privacy enhancing technologies (PETs). Main reason for this was, that PETs were not covered appropriately in the evaluation criteria. This situation has changed somewhat, and therefore this paper reports on a case study, in which we developed Protection Profiles fo...

Blindcoin: Blinded, Accountable Mixes for Bitcoin

Mixcoin is a Bitcoin mixing protocol proposed by Bonneau et al. which provides strong accountability guarantees [13]. However, in the Mixcoin protocol, the mapping from a user’s input to output address is visible to the mixing server. We modify the Mixcoin protocol to provide guarantees that the input/output address mapping for any user is kept hidden from the mixing server. In order to achieve...